from functools import reduce
import sys, os
import math
from collections import Counter
TC = False
class Meat():
def __init__(self) -> None:
self.day = 0
self.price = 0
def solve():
N = int(input())
meats = [Meat() for _ in range(N)]
for i in range(N):
meats[i].day, meats[i].price = map(int, input().split())
price = meats[0].day*meats[0].price
x = meats[0].price
for i in range(1, N):
if meats[i].price < x:
price += meats[i].day*meats[i].price
x = meats[i].price
else:
price += meats[i].day*x
print(price)
if os.path.exists('input.txt'):
debug = True
sys.stdin = open("input.txt","r")
if TC:
for _ in range(int(input())):
solve()
else:
solve()#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed;
cout << setprecision(10);
// freopen("timber_input.txt", "r", stdin);
// freopen("timber_output.txt", "w", stdout);
int n, a, p;
while (~scanf("%d", &n))
{
int min = 101;
int ans = 0;
for (int i = 1; i <= n; i++)
{
scanf("%d%d", &a, &p);
if (p <= min)
ans += a * p, min = p;
else
ans += min * a;
}
printf("%d\n", ans);
}
return 0;
}
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |